Computing top- k Closeness Centrality Faster in Unweighted Graphs
نویسندگان
چکیده
منابع مشابه
Computing Top-k Closeness Centrality Faster in Unweighted Graphs
Given a connected graph G = (V,E), the closeness centrality of a vertex v is defined as n−1 ∑ w∈V d(v,w) . This measure is widely used in the analysis of real-world complex networks, and the problem of selecting the k most central vertices has been deeply analysed in the last decade. However, this problem is computationally not easy, especially for large networks: in the first part of the paper...
متن کاملComputing Top-k Closeness Centrality in Fully-dynamic Graphs
Closeness is a widely-studied centrality measure. Since it requires all pairwise distances, computing closeness for all nodes is infeasible for large real-world networks. However, for many applications, it is only necessary to find the k most central nodes and not all closeness values. Prior work has shown that computing the top-k nodes with highest closeness can be done much faster than comput...
متن کاملCloseness Centrality Extended To Unconnected Graphs : The Harmonic Centrality Index
Social network analysis is a rapid expanding interdisciplinary field, growing from work of sociologists, physicists, historians, mathematicians, political scientists, etc. Some methods have been commonly accepted in spite of defects, perhaps because of the rareness of synthetic work like (Freeman, 1978; Faust & Wasserman, 1992). In this article, we propose an alternative index of closeness cent...
متن کاملA Faster Method to Estimate Closeness Centrality Ranking
Closeness centrality is one way of measuring how central a node is in the given network. The closeness centrality measure assigns a centrality value to each node based on its accessibility to the whole network. In real life applications, we are mainly interested in ranking nodes based on their centrality values. The classical method to compute the rank of a node first computes the closeness cen...
متن کاملFast and Simple Computation of Top-k Closeness Centralities
Closeness is an important centrality measure widely used in the analysis of real-world complex networks. In particular, the problem of selecting the k most central nodes with respect to this measure has been deeply analyzed in the last decade. However, even for not very large networks, this problem is computationally intractable in practice: indeed, Abboud et al have recently shown that its com...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Knowledge Discovery from Data
سال: 2019
ISSN: 1556-4681,1556-472X
DOI: 10.1145/3344719